Distributed Suffix Tree for Peer-to-Peer Search
نویسندگان
چکیده
Establishing an appropriate semantic overlay on Peer-to-Peer networks to obtain both semantic ability and scalability is a challenge. Current DHT-based P2P networks are limited in their ability to support semantic search. This paper proposes the DST (Distributed Suffix Tree) overlay as the intermediate layer between the DHT overlay and the semantic overlay. The DST overlay supports search of keyword sequences. Its time cost is sub-linear with the length of the keyword sequences. Using a common interface, the DST overlay is independent of the variation of the underlying DHT overlays. Analysis and experiments show that DST-based search is fast, load-balanced, and useful in realizing accurate content search on large networks.
منابع مشابه
An Efficient Semantic Search Scheme for Decentralized P2P Environment
Peer-to-peer (P2P) is becoming prevalent on the Internet. However, due to the nature of exact hash matching, the DHT-based P2P itself doesn’t support decentralized semantic search. In this letter, we propose a Decentralized Unicode Suffix Tree Overlay (DUSTO), which can support multiple languages and keywords search. The simulation results indicate the average search length of DUSTO method is 7...
متن کاملRange Queries over DHTs
Distributed Hash Tables (DHTs) are scalable peer-to-peer systems that support exact match lookups. This paper describes the construction and use of a Prefix Hash Tree (PHT) – a distributed data structure that supports range queries over DHTs. PHTs use the hash-table interface of DHTs to construct a search tree that is efficient (insertions/lookups take DHT lookups, where D is the data domain be...
متن کاملPeer-to-Peer Similarity Search Based on M-Tree Indexing
Similarity search in metric spaces has several important applications both in centralized and distributed environments. In centralized applications, such as similarity-based image retrieval, usually a server indexes its data with a stateof-the-art centralized metric indexing technique, such as the M-Tree. In this paper, we propose a framework for distributed similarity search, where each partic...
متن کاملRange queries over skip tree graphs
The support for complex queries, such as range, prefix and aggregation queries, over structured peer-to-peer systems is currently an active and significant topic of research. This paper demonstrates how Skip Tree Graph, as a novel structure, presents an efficient solution to that problem area through provision of a distributed search tree functionality on decentralised and dynamic environments....
متن کاملSkip B-Trees
We describe a new data structure, the Skip B-Tree, that combines the advantages of skip graphs with features of traditional Btrees. A skip B-Tree provides efficient search, insertion and deletion operations. The data structure is highly fault tolerant even to adversarial failures, and allows for particularly simple repair mechanisms. Related resource keys are kept in blocks near each other enab...
متن کامل